Automated Termination Proofs Using Walther Recursion

نویسندگان

  • Alexander Wu
  • David A. McAllester
  • Leonard A. Gould
  • Luis Rodriguez
چکیده

In this thesis, I present an improved method for automatic proofs of termination through a syntactic measurement of sizing that was first developed by Walther. We discuss formal requirements for proving termination using this method and how it can be generalized to other languages. We present a simple set-theoretic language as an example which can be used to write basic Lisp-like programs. Using this language, we define strict syntactic requirements on how to prove termination and then produce inference rules that indicate how these requirements can be established. Several sample algorithms whose termination proofs are sketched using the inference rules are presented in order to show the power of the approach. Last, we discuss the issue of soundness of these rules, as well as issues of the decidability and efficiency of implementing such a system. Thesis Supervisor: David A. McAllester Title: Associate Professor Acknowledgments I would especially like to thank David McAllester, my thesis advisor, for all his help and more importantly, patience and understanding. None of this work would have been possible without his guidance. Special thanks also go to Carl Witty, Robert Givan, and Luis Rodriguez, whose showed me some of the more unusual aspects of graduate life. This work is dedicated to my sister, Cynara, who is undergoing trying times right now. I hope that everything turns out for the better. I may not be the best friend that you need right now but I still love you very much. I am also forever indebted to my parents for everything they have done for me all these years. Thanks, Mom and Dad. This is for you. Finally, a thousand thanks go to all my friends here who never gave up on me despite all the time I spent doing thesis instead of with you guys. James, maybe I still have time to pick up ultimate. Henry, once this damned thing is finished, we can play tennis. Howard, thanks for trying to make me a "Superstar". It didn't quite work but you did the best with what you had. Yong, I'm sorry I didn't have quite what it takes you are the "Chosen One" in more ways than one. To everyone that can't be named, or this thesis would double in size, you all have made these five years the best of my life. I'll always remember the great times there were.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Termination of Theorem Proving by Reuse

We investigate the improvement of theorem provers by re-using previously computed proofs. We formulate our method for reusing proofs as an instance of the problem reduction paradigm and then develop a termination requirement for our reuse procedure. We prove the soundness of our proposal and show that reusability of proofs is not spoiled by the termination requirement imposed on the reuse proce...

متن کامل

Automated Termination Proofs with Measure Functions

This paper deals with the automation of termination proofs for recursively deened algorithms (i.e. algorithms in a pure functional language). Previously developed methods for their termination proofs either had a low degree of automation or they were restricted to one single xed measure function to compare data objects. To overcome these drawbacks we introduce a calculus for automated terminati...

متن کامل

Walther Recursion

Primitive recursion is a well known syntactic restriction on recursive deenitions which guarantees termination. Unfortunately many natural deenitions, such as the most common deenition of Euclid's GCD algorithm, are not primitive recursive. Walther has recently given a proof system for verifying termination of a broader class of deenitions. Although Walther's system is highly automatible, the c...

متن کامل

AProVE: A System for Proving Termination

The system AProVE (Automated Program Verification Environment) can be used for automated termination and innermost termination proofs of (conditional) term rewrite systems (TRSs). AProVE currently offers the techniques of recursive path orders possibly with status [3] (Sect. 2), dependency pairs including recent refinements such as narrowing, rewriting, and instantiation of dependency pairs [1,...

متن کامل

Partial Recursive Functions in Higher-Order Logic

Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for them. Our method expresses termination in a uniform manner and includes a very general form of pattern matching, where patterns can be arbitrary expressions. Termination proofs can be deferred, restricted to subsets of argument...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006